Theoretical and Practical Complexity of UML

نویسندگان

  • John Erickson
  • Keng Siau
چکیده

Systems development methods have become more complex, concurrently with today’s systems. UML (Unified Modeling Language) has been criticized for its complexity, for those learning and using it. Using Rossi and Brinkkemper’s (1996) metrics, Siau and Cao, (2001) completed a complexity analysis of UML and other modeling techniques, finding that UML is more complex than other techniques. Siau, Erickson and Lee (2002) argued that Rossi and Brinkkemper’s metrics present the theoretical maximum, as opposed to a practical complexity, which must be less than the maximum. Therefore, Siau and Cao’s UML complexity analysis represents the theoretical complexity of UML. The current research proposes that a subset of UML (a kernel) composed of the most commonly used constructs, would more closely represent the complexity that practitioners face when using the language. A Delphi study is conducted using practitioners as experts, in an attempt to identify a use-based UML kernel and UML’s practical complexity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Theoretical and Practical Complexity of Unified Modeling Language: Delphi Study and Metrics Analyses

Systems have become increasingly complex, and as a result development methods have become more complex as well. The unified modeling language (UML) has been criticized for the often cited and sometimes overwhelming complexity it presents to its users, and those seeking to learn to use it. Using Rossi and Brinkkemper’s (1996) complexity metrics, Siau and Cao (2001) completed a complexity analysi...

متن کامل

Toward Practical Measures of Complexity in Real Time Modeling Methods

Systems development methods have become more complex, concurrently with many of today’s systems. UML has been criticized for its complexity. Using Rossi and Brinkkemper’s (1996) complexity metrics, Siau and Cao, (2001) completed a complexity analysis of UML and other modeling techniques, finding that UML is more complex than other techniques. Siau, Erickson and Lee (2002) proposed that Rossi an...

متن کامل

On the Application of Information Entropy-based Multi-attribute Decision in UML Class Diagram Metrics

The research, development and applications of software measurement have been carried out for more than forty years. Many researchers have done much in it, obtained lots of theoretical results, and developed a series of practical applications. At present, with the rapid development of object-oriented technology used in software theories and application, how to measure software in an effectively ...

متن کامل

Biclique Cryptanalysis of Block Ciphers LBlock and TWINE-80 with Practical Data Complexity

In the biclique attack, a shorter biclique usually results in less data complexity, but at the expense of more computational complexity. The early abort technique can be used in partial matching part of the biclique attack in order to slightly reduce the computations. In this paper, we make use of this technique, but instead of slight improvement in the computational complexity, we keep the amo...

متن کامل

Inheritance of Dynamic Behavior in UML

One of the key issues of object-oriented modeling and design is inheritance. It allows for the definition of subclasses that inherit features of some superclass. Inheritance is well defined for static properties of classes such as attributes and operations. However, there is no general agreement on the meaning of inheritance when considering the dynamic behavior of objects, captured by their li...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004